A Practical Genetic Algorithm for Obstacles Avoidance Robot Motion Planning

نویسنده

  • M. M. Attiah
چکیده

Genetic Algorithms is one of the latest AI techniques that are used in many engineering applications. Motion Planning of complex robot arms is a difficult problem that requires an efficient search and optimization algorithms. Many different approaches exist to motion planning and none of them is ideal in all situations. This paper introduces a new approach to Motion planning employing genetic algorithms. Motion planning problem is defined. Then conversion of the motion planning problem to a global optimization problem has been shown and thus solved with a genetic algorithm. Modifications of the standard genetic operators have been done to implement the proposed approach. The approach is illustrated and applied to two simple planer robot arms with 2 and 3 degrees of freedom respectively, and a more complex 4 degrees of freedom robot arm in 3D space. Cubic obstacles were considered in the motion planning environment. A program to implement this approach has been written. Finally simulation results for different motion planning problems are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Planning Robot Motion in a 2-D Region with Unknown Obstacles

The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.

متن کامل

Robot Motion Planning with Neuro-Genetic-Fuzzy Approach in Dynamic Environment

To find an optimal path for robots in an environment that is only partially known and continuously changing is a difficult problem. This paper presents a new method for generating a collision-free near-optimal path for an autonomous mobile robot in a dynamic environment containing moving and static obstacles using neural network and fuzzy logic with genetic algorithm. The mobile robot selects a...

متن کامل

Visual Avoidance of Moving Obstacles Based on Vector Field Disturbances

In this paper, we propose a new method for real time obstacle avoidance using visual information. It is based on our on-going research on vector fields and potential functions associated to successful motion planning algorithms. Specifically, this paper addresses the avoidance of dynamic obstacles, which have the property of producing instabilities in the navigation vector field associated to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007